The Inapproximability of Illuminating Polygons by α-Floodlights

نویسندگان

  • Ahmed Abdelkader
  • Ahmed Saeed
  • Khaled A. Harras
  • Amr Mohamed
چکیده

We consider variants of the art gallery problem where guard visibility is limited to a certain angular aperture α. We show that the problem is NP-hard even when guards can be located in the interior of the polygon. We then proceed to prove that both this problem and its vertex variant, where guard placement is restricted to the vertices of the polygon, are APX-hard. We observe that earlier constructions for such results in art gallery problems with 360◦ guards, usually required them to cover few specific elements. We exploit this by carefully updating the construction to replace 360◦ guards with α-floodlights. Similar transformations may be applicable to other constructions in traditional art gallery theorems, which is of independent interest.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-Floodlight Illumination of Convex Polygons

A floodlight of size α is a light source that projects light in a cone of size α . In this paper we study the problem of illuminating a convex polygon using floodlights. We give an O(n 2 ) time algorithm to find an optimal pair of floodlights to illuminate a convex polygon P with n vertices; that is a pair of floodlights to illuminate a convex polygon in such a way that the sum of their sizes i...

متن کامل

Illuminating triangles and quadrilaterals with vertex floodlights

We show that three π/6 vertex floodlights suffice to illuminate any triangle, and we prove that any quadrilateral can be illuminated by three π/4 vertex floodlights.

متن کامل

Floodlight illumination of infinite wedges

The floodlight illumination problem asks whether there exists a one-to-one placement of n floodlights illuminating infinite wedges of angles α1, . . . , αn at n sites p1, . . . , pn in a plane such that a given infinite wedge W of angle θ located at point q is completely illuminated by the floodlights. We prove that this problem is NP-hard, closing an open problem from 2001 [6]. In fact, we sho...

متن کامل

Continuous Surveillance of Points by rotating Floodlights

Let P and F be sets of n ≥ 2 and m ≥ 2 points in a plane, respectively. We study the problem of finding the minimum angle α ∈ [2π/m, 2π] such that one can install at each point of F a stationary rotating floodlight with illumination angle α, initially oriented in a suitable direction, in such a way that, at all times, every target point of P is illuminated by at least one floodlight. All floodl...

متن کامل

Continuous Surveillance of Points by Rotating Floodlights

Let P and F be sets of n ≥ 2 and m ≥ 2 points in the plane, respectively, so that P ∪ F is in general position. In this paper we study the problem of finding the minimum angle α ∈ [2π/m, 2π] such that one can install at each point of F a stationary rotating floodlight with illumination angle α, initially oriented in some direction, in such a way every target point of P is illuminated at any tim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015